On finding an empty staircase polygon of largest area (width) in a planar point-set
نویسندگان
چکیده
منابع مشابه
Recognition of Largest Empty Orthoconvex Polygon in a Point Set
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space complexities of the proposed algorithm are O(n) and O(n) respectively.
متن کاملFinding the Largest Area Axis-parallel Rectangle in a Polygon
This paper considers the geometric optimization problem of nding the Largest area axis-parallel Rectangle (LR) in an n-vertex general polygon. We characterize the LR for general polygons by considering diierent cases based on the types of contacts between the rectangle and the polygon. A general framework is presented for solving a key subproblem of the LR problem which dominates the running ti...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملOn the maximum area pentagon in a planar point set
A finite set of points in the plane is described as in convex position if it forms the set of vertices of a convex polygon. This work studies the ratio between the maximum area of convex heptagons with vertices in P and the area of the convex hull of P, where the planar point set P is in convex position.
متن کاملOn the size of the largest empty box amidst a point set
The problem of finding the largest empty axis-parallel box amidst a point configuration is a classical problem in computational complexity theory. It is known that the volume of the largest empty box is of asymptotic order 1/n for n → ∞ and fixed dimension d. However, it is natural to assume that the volume of the largest empty box increases as d gets larger. In the present paper we prove that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2003
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(03)00015-4